Row and Column Concatenation methods for Stability Testing of Two Dimensional Recursive Filters
نویسندگان
چکیده
–The stability testing of first quadrant quarter-plane (QP) two dimensional recursive digital filters had been a classical problem for the last two decades. In literature, the two major types of stability testing methods available are algebraic and mapping methods. Even though the algebraic methods can determine the stability in finite number of steps, it has a few practical limitations in its implementations and it consumes very large time to find the exact stability as it requires larger number of calculations. Moreover, the accuracy of the algebraic methods is also affected by the finite word length effects of the computer. The mapping methods, in general cannot guarantee the stability of given recursive digital filter in finite number of steps as it can determine the stability only in infinite number of steps. Out of the mapping methods, Jury’s row and column algorithms have been considered as highly efficient, even though they still run short of accuracy due to the undefined length of the FFT used. Hence, the best mapping method is not yet available, though some researchers like Bistritz have been working on this problem even now.The main aim of this paper is to find the simple and fast solution for testing the stability of first quadrant quarter-plane two dimensional recursive digital filters. In this work, it is assumed that the given transfer function is devoid of non-essential singularities of second kind. A new mapping stability test procedure for two dimensional quarter-plane recursive digital filter (QP) is proposed which is primarily based on the row and column concatenation method. One important advantage of the proposed test procedure is that it requires single 1-D polynomials to be tested for stability for two dimensional recursive digital filters of any order.This method gives a simple and best solution procedure even for barely stable or barely unstable recursive digital filters. Sufficient examples are taken from the literature for two dimensional recursive digital filters and the same accurate results as that found in the literature are also obtained using this method.
منابع مشابه
Stability Testing of Two Dimensional Recursive Filters Using Mapping Methods
The stability testing of first quadrant quarter-plane (QP) two dimensional recursive digital filters had been a classical problem for the last two decades. In literature, the two major types of stability testing methods available are algebraic and mapping methods. Even though the algebraic methods can determine the stability in finite number of steps, it has a few practical limitations in its i...
متن کاملA Comparative Study of Stability Testing Approaches of Two-Dimensional Recursive Digital Filters
There are many problems in science and engineering whose solution is applied in the design of Multi-Dimensional (MD) digital filters. Digital filtering finds an important position in the field of digital signal and image processing. Recently there had been a great deal of interest in the design and stability analysis of Two-Dimensional (2-D) recursive digital filters. The design techniques for ...
متن کاملComputation of two-dimensional complex cepstrum
A technique based on fitting splines to the phase derivative curve is presented for the efficient and reliable computation of the two—dimensional complex cepstrum. The technique is an adaptive numerical integration scheme and makes use of several computational strategies within the Tribolet's phase unwrapping algorithm. An application of the complex cepstrum in testing the stability of two—dime...
متن کاملA Closed-Form Solution for Two-Dimensional Diffusion Equation Using Crank-Nicolson Finite Difference Method
In this paper a finite difference method for solving 2-dimensional diffusion equation is presented. The method employs Crank-Nicolson scheme to improve finite difference formulation and its convergence and stability. The obtained solution will be a recursive formula in each step of which a system of linear equations should be solved. Given the specific form of obtained matrices, rather than sol...
متن کاملAdaptive beamforming in row-column addressed arrays for 3D ultrasound imaging
In recent years, to reduce the complexity of implementation, the use of 2D arrays with restricted row-column addressing has been considered for 3D ultrasound imaging. In this paper, two methods of adaptive beamforming based on the minimum variance method are represented in such a way that the computational load is much less than using the full adaptive beamforming method. In both proposed metho...
متن کامل